TSTP Solution File: NUM691^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM691^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n024.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 08:14:26 EDT 2024
% Result : Theorem 0.14s 0.39s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 15
% Syntax : Number of formulae : 73 ( 3 unt; 8 typ; 0 def)
% Number of atoms : 312 ( 114 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 503 ( 80 ~; 55 |; 7 &; 322 @)
% ( 2 <=>; 37 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 8 con; 0-2 aty)
% Number of variables : 74 ( 0 ^ 74 !; 0 ?; 74 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
nat: $tType ).
thf(func_def_0,type,
nat: $tType ).
thf(func_def_1,type,
x: nat ).
thf(func_def_2,type,
y: nat ).
thf(func_def_3,type,
z: nat ).
thf(func_def_4,type,
u: nat ).
thf(func_def_5,type,
more: nat > nat > $o ).
thf(func_def_7,type,
pl: nat > nat > nat ).
thf(f98,plain,
$false,
inference(avatar_sat_refutation,[],[f62,f75,f89,f97]) ).
thf(f97,plain,
( ~ spl0_1
| spl0_2 ),
inference(avatar_contradiction_clause,[],[f96]) ).
thf(f96,plain,
( $false
| ~ spl0_1
| spl0_2 ),
inference(subsumption_resolution,[],[f95,f55]) ).
thf(f55,plain,
( ( ( more @ x @ y )
= $true )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f54]) ).
thf(f54,plain,
( spl0_1
<=> ( ( more @ x @ y )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
thf(f95,plain,
( ( ( more @ x @ y )
!= $true )
| spl0_2 ),
inference(trivial_inequality_removal,[],[f92]) ).
thf(f92,plain,
( ( $true != $true )
| ( ( more @ x @ y )
!= $true )
| spl0_2 ),
inference(superposition,[],[f80,f46]) ).
thf(f46,plain,
! [X2: nat,X3: nat,X0: nat] :
( ( ( more @ ( pl @ X0 @ X2 ) @ ( pl @ X3 @ X2 ) )
= $true )
| ( ( more @ X0 @ X3 )
!= $true ) ),
inference(equality_resolution,[],[f37]) ).
thf(f37,plain,
! [X2: nat,X3: nat,X0: nat,X1: nat] :
( ( ( more @ X0 @ X3 )
!= $true )
| ( ( more @ ( pl @ X0 @ X2 ) @ ( pl @ X3 @ X1 ) )
= $true )
| ( X1 != X2 ) ),
inference(cnf_transformation,[],[f35]) ).
thf(f35,plain,
! [X0: nat,X1: nat,X2: nat,X3: nat] :
( ( ( more @ X0 @ X3 )
!= $true )
| ( ( more @ ( pl @ X0 @ X2 ) @ ( pl @ X3 @ X1 ) )
= $true )
| ( ( ( more @ X2 @ X1 )
!= $true )
& ( X1 != X2 ) ) ),
inference(rectify,[],[f30]) ).
thf(f30,plain,
! [X1: nat,X0: nat,X2: nat,X3: nat] :
( ( ( more @ X1 @ X3 )
!= $true )
| ( ( more @ ( pl @ X1 @ X2 ) @ ( pl @ X3 @ X0 ) )
= $true )
| ( ( ( more @ X2 @ X0 )
!= $true )
& ( X0 != X2 ) ) ),
inference(flattening,[],[f29]) ).
thf(f29,plain,
! [X2: nat,X0: nat,X3: nat,X1: nat] :
( ( ( more @ ( pl @ X1 @ X2 ) @ ( pl @ X3 @ X0 ) )
= $true )
| ( ( ( more @ X2 @ X0 )
!= $true )
& ( X0 != X2 ) )
| ( ( more @ X1 @ X3 )
!= $true ) ),
inference(ennf_transformation,[],[f25]) ).
thf(f25,plain,
! [X2: nat,X0: nat,X3: nat,X1: nat] :
( ( ( more @ X1 @ X3 )
= $true )
=> ( ( ( ( more @ X2 @ X0 )
!= $true )
=> ( X0 = X2 ) )
=> ( ( more @ ( pl @ X1 @ X2 ) @ ( pl @ X3 @ X0 ) )
= $true ) ) ),
inference(flattening,[],[f14]) ).
thf(f14,plain,
! [X0: nat,X1: nat,X2: nat,X3: nat] :
( ( ( more @ X1 @ X3 )
= $true )
=> ( ( ( ( more @ X2 @ X0 )
!= $true )
=> ( X0 = X2 ) )
=> ( ( more @ ( pl @ X1 @ X2 ) @ ( pl @ X3 @ X0 ) )
= $true ) ) ),
inference(fool_elimination,[],[f13]) ).
thf(f13,plain,
! [X0: nat,X1: nat,X2: nat,X3: nat] :
( ( more @ X1 @ X3 )
=> ( ( ~ ( more @ X2 @ X0 )
=> ( X0 = X2 ) )
=> ( more @ ( pl @ X1 @ X2 ) @ ( pl @ X3 @ X0 ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f5,axiom,
! [X4: nat,X1: nat,X3: nat,X2: nat] :
( ( more @ X1 @ X2 )
=> ( ( ~ ( more @ X3 @ X4 )
=> ( X3 = X4 ) )
=> ( more @ ( pl @ X1 @ X3 ) @ ( pl @ X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.64CWdPmxeN/Vampire---4.8_32574',satz22b) ).
thf(f80,plain,
( ( ( more @ ( pl @ x @ z ) @ ( pl @ y @ z ) )
!= $true )
| spl0_2 ),
inference(superposition,[],[f42,f77]) ).
thf(f77,plain,
( ( z = u )
| spl0_2 ),
inference(trivial_inequality_removal,[],[f76]) ).
thf(f76,plain,
( ( $true != $true )
| ( z = u )
| spl0_2 ),
inference(superposition,[],[f60,f39]) ).
thf(f39,plain,
( ( ( more @ z @ u )
= $true )
| ( z = u ) ),
inference(cnf_transformation,[],[f32]) ).
thf(f32,plain,
( ( ( more @ z @ u )
= $true )
| ( z = u ) ),
inference(ennf_transformation,[],[f24]) ).
thf(f24,plain,
( ( ( more @ z @ u )
!= $true )
=> ( z = u ) ),
inference(flattening,[],[f20]) ).
thf(f20,plain,
( ( ( more @ z @ u )
!= $true )
=> ( z = u ) ),
inference(fool_elimination,[],[f19]) ).
thf(f19,plain,
( ~ ( more @ z @ u )
=> ( z = u ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
( ~ ( more @ z @ u )
=> ( z = u ) ),
file('/export/starexec/sandbox2/tmp/tmp.64CWdPmxeN/Vampire---4.8_32574',n) ).
thf(f60,plain,
( ( ( more @ z @ u )
!= $true )
| spl0_2 ),
inference(avatar_component_clause,[],[f58]) ).
thf(f58,plain,
( spl0_2
<=> ( ( more @ z @ u )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
thf(f42,plain,
( ( more @ ( pl @ x @ z ) @ ( pl @ y @ u ) )
!= $true ),
inference(cnf_transformation,[],[f28]) ).
thf(f28,plain,
( ( ( more @ ( pl @ x @ z ) @ ( pl @ y @ u ) )
!= $true )
& ( ( pl @ x @ z )
!= ( pl @ y @ u ) ) ),
inference(ennf_transformation,[],[f21]) ).
thf(f21,plain,
~ ( ( ( more @ ( pl @ x @ z ) @ ( pl @ y @ u ) )
!= $true )
=> ( ( pl @ x @ z )
= ( pl @ y @ u ) ) ),
inference(flattening,[],[f16]) ).
thf(f16,plain,
~ ( ( ( more @ ( pl @ x @ z ) @ ( pl @ y @ u ) )
!= $true )
=> ( ( pl @ x @ z )
= ( pl @ y @ u ) ) ),
inference(fool_elimination,[],[f15]) ).
thf(f15,plain,
~ ( ~ ( more @ ( pl @ x @ z ) @ ( pl @ y @ u ) )
=> ( ( pl @ x @ z )
= ( pl @ y @ u ) ) ),
inference(rectify,[],[f7]) ).
thf(f7,negated_conjecture,
~ ( ~ ( more @ ( pl @ x @ z ) @ ( pl @ y @ u ) )
=> ( ( pl @ x @ z )
= ( pl @ y @ u ) ) ),
inference(negated_conjecture,[],[f6]) ).
thf(f6,conjecture,
( ~ ( more @ ( pl @ x @ z ) @ ( pl @ y @ u ) )
=> ( ( pl @ x @ z )
= ( pl @ y @ u ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.64CWdPmxeN/Vampire---4.8_32574',satz23) ).
thf(f89,plain,
( spl0_1
| spl0_2 ),
inference(avatar_contradiction_clause,[],[f88]) ).
thf(f88,plain,
( $false
| spl0_1
| spl0_2 ),
inference(trivial_inequality_removal,[],[f87]) ).
thf(f87,plain,
( ( ( pl @ x @ z )
!= ( pl @ x @ z ) )
| spl0_1
| spl0_2 ),
inference(forward_demodulation,[],[f79,f64]) ).
thf(f64,plain,
( ( x = y )
| spl0_1 ),
inference(trivial_inequality_removal,[],[f63]) ).
thf(f63,plain,
( ( $true != $true )
| ( x = y )
| spl0_1 ),
inference(superposition,[],[f56,f40]) ).
thf(f40,plain,
( ( ( more @ x @ y )
= $true )
| ( x = y ) ),
inference(cnf_transformation,[],[f31]) ).
thf(f31,plain,
( ( ( more @ x @ y )
= $true )
| ( x = y ) ),
inference(ennf_transformation,[],[f23]) ).
thf(f23,plain,
( ( ( more @ x @ y )
!= $true )
=> ( x = y ) ),
inference(flattening,[],[f18]) ).
thf(f18,plain,
( ( ( more @ x @ y )
!= $true )
=> ( x = y ) ),
inference(fool_elimination,[],[f17]) ).
thf(f17,plain,
( ~ ( more @ x @ y )
=> ( x = y ) ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
( ~ ( more @ x @ y )
=> ( x = y ) ),
file('/export/starexec/sandbox2/tmp/tmp.64CWdPmxeN/Vampire---4.8_32574',m) ).
thf(f56,plain,
( ( ( more @ x @ y )
!= $true )
| spl0_1 ),
inference(avatar_component_clause,[],[f54]) ).
thf(f79,plain,
( ( ( pl @ x @ z )
!= ( pl @ y @ z ) )
| spl0_2 ),
inference(superposition,[],[f41,f77]) ).
thf(f41,plain,
( ( pl @ x @ z )
!= ( pl @ y @ u ) ),
inference(cnf_transformation,[],[f28]) ).
thf(f75,plain,
( ~ spl0_2
| spl0_1 ),
inference(avatar_split_clause,[],[f74,f54,f58]) ).
thf(f74,plain,
( ( ( more @ z @ u )
!= $true )
| spl0_1 ),
inference(trivial_inequality_removal,[],[f71]) ).
thf(f71,plain,
( ( ( more @ z @ u )
!= $true )
| ( $true != $true )
| spl0_1 ),
inference(superposition,[],[f66,f48]) ).
thf(f48,plain,
! [X2: nat,X3: nat,X1: nat] :
( ( ( more @ ( pl @ X3 @ X2 ) @ ( pl @ X3 @ X1 ) )
= $true )
| ( ( more @ X2 @ X1 )
!= $true ) ),
inference(equality_resolution,[],[f44]) ).
thf(f44,plain,
! [X2: nat,X3: nat,X0: nat,X1: nat] :
( ( ( more @ X2 @ X1 )
!= $true )
| ( X0 != X3 )
| ( ( more @ ( pl @ X3 @ X2 ) @ ( pl @ X0 @ X1 ) )
= $true ) ),
inference(cnf_transformation,[],[f36]) ).
thf(f36,plain,
! [X0: nat,X1: nat,X2: nat,X3: nat] :
( ( ( more @ X2 @ X1 )
!= $true )
| ( ( ( more @ X3 @ X0 )
!= $true )
& ( X0 != X3 ) )
| ( ( more @ ( pl @ X3 @ X2 ) @ ( pl @ X0 @ X1 ) )
= $true ) ),
inference(rectify,[],[f34]) ).
thf(f34,plain,
! [X1: nat,X2: nat,X3: nat,X0: nat] :
( ( ( more @ X3 @ X2 )
!= $true )
| ( ( ( more @ X0 @ X1 )
!= $true )
& ( X0 != X1 ) )
| ( ( more @ ( pl @ X0 @ X3 ) @ ( pl @ X1 @ X2 ) )
= $true ) ),
inference(flattening,[],[f33]) ).
thf(f33,plain,
! [X1: nat,X0: nat,X2: nat,X3: nat] :
( ( ( more @ ( pl @ X0 @ X3 ) @ ( pl @ X1 @ X2 ) )
= $true )
| ( ( more @ X3 @ X2 )
!= $true )
| ( ( ( more @ X0 @ X1 )
!= $true )
& ( X0 != X1 ) ) ),
inference(ennf_transformation,[],[f26]) ).
thf(f26,plain,
! [X1: nat,X0: nat,X2: nat,X3: nat] :
( ( ( ( more @ X0 @ X1 )
!= $true )
=> ( X0 = X1 ) )
=> ( ( ( more @ X3 @ X2 )
= $true )
=> ( ( more @ ( pl @ X0 @ X3 ) @ ( pl @ X1 @ X2 ) )
= $true ) ) ),
inference(flattening,[],[f10]) ).
thf(f10,plain,
! [X0: nat,X1: nat,X2: nat,X3: nat] :
( ( ( ( more @ X0 @ X1 )
!= $true )
=> ( X0 = X1 ) )
=> ( ( ( more @ X3 @ X2 )
= $true )
=> ( ( more @ ( pl @ X0 @ X3 ) @ ( pl @ X1 @ X2 ) )
= $true ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f9,plain,
! [X0: nat,X1: nat,X2: nat,X3: nat] :
( ( ~ ( more @ X0 @ X1 )
=> ( X0 = X1 ) )
=> ( ( more @ X3 @ X2 )
=> ( more @ ( pl @ X0 @ X3 ) @ ( pl @ X1 @ X2 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f4,axiom,
! [X1: nat,X2: nat,X4: nat,X3: nat] :
( ( ~ ( more @ X1 @ X2 )
=> ( X1 = X2 ) )
=> ( ( more @ X3 @ X4 )
=> ( more @ ( pl @ X1 @ X3 ) @ ( pl @ X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.64CWdPmxeN/Vampire---4.8_32574',satz22a) ).
thf(f66,plain,
( ( ( more @ ( pl @ x @ z ) @ ( pl @ x @ u ) )
!= $true )
| spl0_1 ),
inference(superposition,[],[f42,f64]) ).
thf(f62,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f51,f58,f54]) ).
thf(f51,plain,
( ( ( more @ x @ y )
!= $true )
| ( ( more @ z @ u )
!= $true ) ),
inference(trivial_inequality_removal,[],[f50]) ).
thf(f50,plain,
( ( ( more @ z @ u )
!= $true )
| ( ( more @ x @ y )
!= $true )
| ( $true != $true ) ),
inference(superposition,[],[f42,f45]) ).
thf(f45,plain,
! [X2: nat,X3: nat,X0: nat,X1: nat] :
( ( ( more @ ( pl @ X3 @ X2 ) @ ( pl @ X0 @ X1 ) )
= $true )
| ( ( more @ X2 @ X1 )
!= $true )
| ( ( more @ X3 @ X0 )
!= $true ) ),
inference(cnf_transformation,[],[f36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : NUM691^1 : TPTP v8.1.2. Released v3.7.0.
% 0.11/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.36 % Computer : n024.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 14:33:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TH0_THM_EQU_NAR problem
% 0.14/0.37 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.64CWdPmxeN/Vampire---4.8_32574
% 0.14/0.38 % (32767)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (2999ds/27Mi)
% 0.14/0.38 % (300)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.14/0.38 % (301)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.14/0.38 % (302)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (2999ds/275Mi)
% 0.14/0.38 % (32765)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (2999ds/183Mi)
% 0.14/0.38 % (303)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (2999ds/18Mi)
% 0.14/0.38 % (300)Instruction limit reached!
% 0.14/0.38 % (300)------------------------------
% 0.14/0.38 % (300)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (301)Instruction limit reached!
% 0.14/0.38 % (301)------------------------------
% 0.14/0.38 % (301)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (301)Termination reason: Unknown
% 0.14/0.38 % (301)Termination phase: Property scanning
% 0.14/0.38
% 0.14/0.38 % (301)Memory used [KB]: 895
% 0.14/0.38 % (301)Time elapsed: 0.003 s
% 0.14/0.38 % (301)Instructions burned: 2 (million)
% 0.14/0.38 % (301)------------------------------
% 0.14/0.38 % (301)------------------------------
% 0.14/0.39 % (300)Termination reason: Unknown
% 0.14/0.39 % (300)Termination phase: shuffling
% 0.14/0.39
% 0.14/0.39 % (300)Memory used [KB]: 895
% 0.14/0.39 % (300)Time elapsed: 0.003 s
% 0.14/0.39 % (300)Instructions burned: 2 (million)
% 0.14/0.39 % (300)------------------------------
% 0.14/0.39 % (300)------------------------------
% 0.14/0.39 % (305)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.14/0.39 % (302)First to succeed.
% 0.14/0.39 % (32765)Also succeeded, but the first one will report.
% 0.14/0.39 % (302)Refutation found. Thanks to Tanya!
% 0.14/0.39 % SZS status Theorem for Vampire---4
% 0.14/0.39 % SZS output start Proof for Vampire---4
% See solution above
% 0.14/0.39 % (302)------------------------------
% 0.14/0.39 % (302)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (302)Termination reason: Refutation
% 0.14/0.39
% 0.14/0.39 % (302)Memory used [KB]: 5500
% 0.14/0.39 % (302)Time elapsed: 0.008 s
% 0.14/0.39 % (302)Instructions burned: 6 (million)
% 0.14/0.39 % (302)------------------------------
% 0.14/0.39 % (302)------------------------------
% 0.14/0.39 % (32764)Success in time 0.009 s
% 0.14/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------